Single-machine scheduling under the job rejection constraint
نویسندگان
چکیده
منابع مشابه
The one machine scheduling problem: Insertion of a job under the real-time constraint
We consider a single resource that performs a set of jobs, each job being defined by its operation time and its due date. Jobs are not preemptive, which means that a job that starts cannot be interrupted before completion. These jobs have been scheduled so as to minimize the total tardiness, and the schedule is known. A new job appears in the system at the current point in time that is called t...
متن کاملSingle machine scheduling with interfering job sets
We consider two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent’s objective function is to be minimized. In the first problem (P1) we look at mi...
متن کاملScheduling with regular performance measures and optional job rejection on a single machine
We address single machine problems with optional job–rejection, studied lately in Zhang et al. (2010) and Cao et al. (2006). In these papers, the authors focus on minimizing regular performance measures, i.e., functions that are non-decreasing in the jobs completion time, subject to the constraint that the total rejection cost cannot exceed a predefined upper bound. The authors prove that the c...
متن کاملA bicriteria approach to scheduling a single machine with job rejection and positional penalties
Single machine scheduling problems have been extensively studied in the literature under the assumption that all jobs have to be processed. However, in many practical cases, one may wish to reject the processing of some jobs in the shop, thus resulting in a rejection cost. In such a framework, the scheduler has to decide rst which jobs will be rejected and which will be accepted. Then he has t...
متن کاملSingle Machine Scheduling with Job-Dependent Machine Deterioration
We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.02.006